A Few Minor Queries in Medical Science
نویسندگان
چکیده
منابع مشابه
Reducing a Target Interval to a Few Exact Queries
Many combinatorial problems involving weights can be formulated as a so-called ranged problem. That is, their input consists of a universe U , a (succinctly-represented) set family F ⊆ 2 , a weight function ω : U → {1, . . . , N}, and integers 0 ≤ l ≤ u ≤ ∞. Then the problem is to decide whether there is an X ∈ F such that l ≤ ∑ e∈X ω(e) ≤ u. Well-known examples of such problems include Knapsac...
متن کاملStochastic Packing Integer Programs with Few Queries
We consider a stochastic variant of the integer linear programming problem, which contains random variables in the objective vector. We are allowed to reveal each entry of the objective vector by conducting a query, and the task is to find a good solution by conducting a small number of queries. We propose adaptive and nonadaptive algorithms for this problem, and provide a general technique for...
متن کاملSolving k-SUM Using Few Linear Queries
The k-SUM problem is given n input real numbers to determine whether any k of them sum to zero. The problem is of tremendous importance in the emerging field of complexity theory within P , and it is in particular open whether it admits an algorithm of complexity O(n) with c < dk2 e. Inspired by an algorithm due to Meiser (1993), we show that there exist linear decision trees and algebraic comp...
متن کاملThe Minor Medical Services
to either of the others, or wherever they were required,(1) such transfers have, for nearly a century past, rarely been made. The names of the officers in these three Services were combined in one list, for the first time, in the Indian Army List of 1st October 1906. But they still remain on separate lists for promotion, lo these three Services, thirteen years ago, was added a fourth, the junio...
متن کاملFinding Hamilton cycles in random graphs with few queries
We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of G(n, p) in order to typically find a subgraph possessing a given target property. We show that if p ≥ lnn+ln lnn+ω(1) n , then one can find a Hamilton cycle with high probability after exposing (1+o(1))n edges. Our result i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 1860
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.s4-1.181.455